Restricted ∆-trees in Multiple-Valued Logics
نویسندگان
چکیده
This paper generalises the tree-based data structure of ∆tree to be applied to signed propositional formulas. The ∆-trees allow a compact representation for signed formulas as well as for a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfiability of the input formula. The conversions from signed formulas to ∆-trees and vice versa are described and a notion of restricted form based on this representation is introduced, allowing for a compact representation of formulas in order to consider only those occurrences of literals which are relevant for its satisfiability.
منابع مشابه
Restricted ∆-trees and Reduction Theorems in Multiple-Valued Logics
In this paper we continue the theoretical study of the possible applications of the ∆-tree data structure for multiple-valued logics, specifically, to be applied to signed propositional formulas. The ∆-trees allow a compact representation for signed formulas as well as for a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfi...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملTheory and application of multiple-valued logics for knowledge-based systems
Multiple-valued logics are useful for dealing with uncertainty and imprecision in knowledge-based systems. In this paper, we present the foundations of QMORPH: a tool that assists users in the declaration of such logics and in the declaration of the communication mechanism between two of these different logics by preserving inference.
متن کاملLabelled Deduction over Algebras of Truth-Values
We introduce a framework for presenting non-classical logics in a modular and uniform way as labelled natural deduction systems. The use of algebras of truth-values as the labelling algebras of our systems allows us to give generalized systems for multiple-valued logics. More specifically, our framework generalizes previous work where labels represent worlds in the underlying Kripke structure: ...
متن کاملResolution-Based Theorem Proving for Manyvalued Logics
A general approach to automated theorem proving for all rst-order nite-valued logics that can be deened truth-functionally is described. The suggested proof procedure proceeds in two, largely independent, steps. First, logic-speciic translation calculi are used to generate clause forms for arbitrary formulas of a many-valued logic. The worst-case complexity of the translation rules is analysed ...
متن کامل